729 research outputs found

    A Finite-Time Cutting Plane Algorithm for Distributed Mixed Integer Linear Programming

    Get PDF
    Many problems of interest for cyber-physical network systems can be formulated as Mixed Integer Linear Programs in which the constraints are distributed among the agents. In this paper we propose a distributed algorithm to solve this class of optimization problems in a peer-to-peer network with no coordinator and with limited computation and communication capabilities. In the proposed algorithm, at each communication round, agents solve locally a small LP, generate suitable cutting planes, namely intersection cuts and cost-based cuts, and communicate a fixed number of active constraints, i.e., a candidate optimal basis. We prove that, if the cost is integer, the algorithm converges to the lexicographically minimal optimal solution in a finite number of communication rounds. Finally, through numerical computations, we analyze the algorithm convergence as a function of the network size.Comment: 6 pages, 3 figure

    The Genesis and the Legacy of The Lord of the Rings

    Get PDF
    openQuesta tesi consiste in uno studio de "Il Signore degli Anelli" di J.R.R. Tolkien. Nello specifico, è composta da un'analisi di alcune caratteristiche dell'opera, le sue origini mitologiche e letterarie e la sua influenza su diversi media nella cultura contemporanea.This thesis consists in a study of J.R.R. Tolkien's "The Lord of the Rings". Specifically, it is comprised of an analysis of some of the novel's characteristics, its mythological and literary origins and its influence on different medias in contemporary culture

    Multi-Robot Pickup and Delivery via Distributed Resource Allocation

    Get PDF
    In this article, we consider a large-scale instance of the classical pickup-and-delivery vehicle routing problem that must be solved by a network of mobile cooperating robots. Robots must self-coordinate and self-allocate a set of pickup/delivery tasks while minimizing a given cost figure. This results in a large, challenging mixed-integer linear problem that must be cooperatively solved without a central coordinator. We propose a distributed algorithm based on a primal decomposition approach that provides a feasible solution to the problem in finite time. An interesting feature of the proposed scheme is that each robot computes only its own block of solution, thereby preserving privacy of sensible information. The algorithm also exhibits attractive scalability properties that guarantee solvability of the problem even in large networks. To the best of our knowledge, this is the first attempt to provide a scalable distributed solution to the problem. The algorithm is first tested through Gazebo simulations on a ROS 2 platform, highlighting the effectiveness of the proposed solution. Finally, experiments on a real testbed with a team of ground and aerial robots are provided

    The Effects Induced by Spinal Manipulative Therapy on the Immune and Endocrine Systems

    Get PDF
    Background andObjectives: Spinal manipulations are interventions widely used by different healthcare professionals for the management of musculoskeletal (MSK) disorders. While previous theoretical principles focused predominantly on biomechanical accounts, recent models propose that the observed pain modulatory effects of this form of manual therapy may be the result of more complex mechanisms. It has been suggested that other phenomena like neurophysiological responses and the activation of the immune-endocrine system may explain variability in pain inhibition after the administration of spinal manipulative therapy (SMT). The aim of this paper is to provide an overview of the available evidence supporting the biological plausibility of high-velocity, low-amplitude thrust (HVLAT) on the immune-endocrine system. Materials and Methods: Narrative critical review. An electronic search on MEDLINE, ProQUEST, and Google Scholar followed by a hand and "snowballing" search were conducted to find relevant articles. Studies were included if they evaluated the effects of HVLAT on participants' biomarkers Results: The electronic search retrieved 13 relevant articles and two themes of discussion were developed. Nine studies investigated the effects of SMT on cortisol levels and five of them were conducted on symptomatic populations. Four studies examined the effects of SMT on the immune system and all of them were conducted on healthy individuals. Conclusions: Although spinal manipulations seem to trigger the activation of the neuroimmunoendocrine system, the evidence supporting a biological account for the application of HVLAT in clinical practice is mixed and conflicting. Further research on subjects with spinal MSK conditions with larger sample sizes are needed to obtain more insights about the biological effects of spinal manipulative therapy

    Generalized Assignment for Multi-Robot Systems via Distributed Branch-And-Price

    Get PDF
    In this paper, we consider a network of agents that has to self-assign a set of tasks while respecting resource constraints. One possible formulation is the Generalized Assignment Problem, where the goal is to find a maximum payoff while satisfying capability constraints. We propose a purely distributed branch-and-price algorithm to solve this problem in a cooperative fashion. Inspired by classical (centralized) branch-and-price schemes, in the proposed algorithm each agent locally solves small linear programs, generates columns by solving simple knapsack problems, and communicates to its neighbors a fixed number of basic columns. We prove finite-time convergence of the algorithm to an optimal solution of the problem. Then, we apply the proposed scheme to a generalized assignment scenario in which a team of robots has to serve a set of tasks. We implement the proposed algorithm in a ROS testbed and provide experiments for a team of heterogeneous robots solving the assignment problem

    Getting the Lorentz transformations without requiring an invariant speed

    Full text link
    The structure of the Lorentz transformations follows purely from the absence of privileged inertial reference frames and the group structure (closure under composition) of the transformations---two assumptions that are simple and physically necessary. The existence of an invariant speed is \textit{not} a necessary assumption, and in fact is a consequence of the principle of relativity (though the finite value of this speed must, of course, be obtained from experiment). Von Ignatowsky derived this result in 1911, but it is still not widely known and is absent from most textbooks. Here we present a completely elementary proof of the result, suitable for use in an introductory course in special relativity.Comment: 4 pages, 1 figur
    corecore